package code.starivan.leetcode;

/**
 * Created by Ivan on 2015/10/18.
 */

/*
Given a string S, find the longest palindromic substring in S.
You may assume that the maximum length of S is 1000,
and there exists one unique longest palindromic substring.
*/

public class N005_LongestPalindromicSubstring {
}
